What subshifts are the limit set of a cellular automaton?
نویسندگان
چکیده
Cellular automata are the most natural discretization of dynamical systems. Their long-term behaviour is captured in their limit set, also known as the maximal attractor. We investigate what complexity limit sets can have from the point of view of language theory, and we try to give some dynamical characterizations of subshifts that are limit sets. Then, the inverse problem of determining the limit set of a given CA is discussed in some simple cases.
منابع مشابه
Recursive Cellular Automata Invariant Sets
A bstract. Subshift s of bi-infinit e words give rise to languages in a natural way. Three invariant subshifts associated wit h cellular automata dynamics are considered : the periodic set, non-wandering set , and limit set . Exam ples have been given (see [8,12]) of cellular automata whose invarian t sets give rise to nonrecursive languages. In this pap er , examples are given of cellular aut ...
متن کاملLimit Sets of Stable and Unstable Cellular Automata
We construct a cellular automaton (CA) with a sofic and mixing limit set and then construct a stable CA with the same limit set, showing there exist subshifts that can be limit sets of both stable and unstable CAs, answering a question raised by A. Maass.
متن کاملConstruction of $\mu$-Limit Sets
The µ-limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to infinity. In this article, for a given subshift in a large class of subshifts, we propose the construction of a cellular automaton which realizes this subshift as µ-limit set where µ is the uniform Bernoulli measure.
متن کاملNonrecursive Cellular Automata Invariant Sets
Languages correspo nding to two invariant subshifts, the limit set and periodic set are examined. The complement of the language produced by a cellular automaton limit set is always recursively enumerable (r .e.), and modulo intersection with a regular langu age and s-limited homomor phism, all languages wit h r.e. complements arise this way. Th e language produced by the periodic set is always...
متن کامل0 M ar 2 01 2 On Shift Spaces with Algebraic Structure ⋆
We investigate subshifts with a general algebraic structure and cellular automata on them, with an emphasis on (order-theoretic) lattices. Our main results concern the characterization of Boolean algebraic subshifts, conditions for algebraic subshifts to be recoded into cellwise algebras and the limit dynamics of homomorphic cellular automata on lattice subshifts.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009